Adaptive BDDC in three dimensions
نویسندگان
چکیده
The adaptive BDDC method is extended to the selection of face constraints in three dimensions. A new implementation of the BDDC method is presented based on a global formulation without an explicit coarse problem, with massive parallelism provided by a multifrontal solver. Constraints are implemented by a projection and sparsity of the projected operator is preserved by a generalized change of variables. The effectiveness of the method is illustrated on several engineering problems.
منابع مشابه
Three-level BDDC
BDDC (Balancing Domain Decomposition by Constraints) methods, so far developed for two levels [3, 7, 8], are similar to the balancing Neumann-Neumann algorithms. However, the BDDC coarse problem is given in terms of a set of primal constraints and the matrix of the coarse problem is generated and factored by direct solvers at the beginning of the computation. The coarse component of the precond...
متن کاملAn Adaptive Choice of Primal Constraints for Bddc Domain Decomposition Algorithms
An adaptive choice for primal spaces, based on parallel sums, is developed for BDDC deluxe methods and elliptic problems in three dimensions. The primal space, which form the global, coarse part of the domain decomposition algorithm, and which is always required for any competitive algorithm, is defined in terms of generalized eigenvalue problems related to subdomain edges and faces; selected e...
متن کاملCoupling parallel adaptive mesh refinement with a nonoverlapping domain decomposition solver
We study the effect of adaptive mesh refinement on a parallel domain decomposition solver of a linear system of algebraic equations. These concepts need to be combined within a parallel adaptive finite element software. A prototype implementation is presented for this purpose. It uses adaptive mesh refinement with one level of hanging nodes. Two and three-level versions of the Balancing Domain ...
متن کاملA Bddc Algorithm for Problems with Mortar Discretization
Abstract. A BDDC (balancing domain decomposition by constraints) algorithm is developed for elliptic problems with mortar discretizations for geometrically non-conforming partitions in both two and three spatial dimensions. The coarse component of the preconditioner is defined in terms of one mortar constraint for each edge/face which is an intersection of the boundaries of a pair of subdomains...
متن کاملBddc Preconditioners for Spectral Element Discretizations of Almost Incompressible Elasticity in Three Dimensions Tr2010-928
BDDC algorithms are constructed and analyzed for the system of almost incompressible elasticity discretized with Gauss-Lobatto-Legendre spectral elements in three dimensions. Initially mixed spectral elements are employed to discretize the almost incompressible elasticity system, but a positive definite reformulation is obtained by eliminating all pressure degrees of freedom interior to each su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematics and Computers in Simulation
دوره 82 شماره
صفحات -
تاریخ انتشار 2012